#include"avl.h"
#include<iostream>
#include<vector>
void test_insert()
{
	bit::AVLTree<int,int> tree;
	int source[] = { 4,2,6,1,3,5,15,7,16,14};
	std::vector<int> v;
	int N = 500;
	srand(time(0));
	for (int i = 0; i < N; i++)
	{
		v.push_back(rand());
	}
	int i = 0;
	for (auto item : v)
	{
		tree.Insert(std::make_pair(item, 0));
	}

	tree.inorder();
}
int main()
{
	test_insert();

	return 0;
}